Algorithmic Solvability of the Lifting-Extension Problem

Algorithmic solvability of the lifting-extension problem

Let X and Y be finite simplicial sets (e.g. finite simplicial complexes), both equipped with a free simplicial action of a finite group G. Assuming that Y is dconnected and dimX ≤ 2d, for some d ≥ 1, we provide an algorithm that computes the set of all equivariant homotopy classes of equivariant continuous maps |X| → |Y |; the existence of such a map can be decided even for dimX ≤ 2d+1. For fix...

the problem of divine hiddenness

این رساله به مساله احتجاب الهی و مشکلات برهان مبتنی بر این مساله میپردازد. مساله احتجاب الهی مساله ای به قدمت ادیان است که به طور خاصی در مورد ادیان ابراهیمی اهمیت پیدا میکند. در ادیان ابراهیمی با توجه به تعالی خداوند و در عین حال خالقیت و حضور او و سخن گفتن و ارتباط شهودی او با بعضی از انسانهای ساکن زمین مساله ای پدید میاید با پرسشهایی از قبیل اینکه چرا ارتباط مستقیم ویا حداقل ارتباط وافی به ب...

A Simple Algorithmic Characterization of Uniform Solvability

The Herlihy-Shavit (HS) conditions characterizing the solvability of asynchronous tasks over n processors have been a milestone in the development of the theory of distributed computing. Yet, they were of no help when researcher sought algorithms that do not depend on n. To help in this pursuit we investigate the uniform solvability of an infinite uniform sequence of tasks T0; T1; T2; :::, wher...

Solvability for Parabolic Poincaré Problem

Solvability of an impulsive boundary value problem on the half-line via critical point theory

In this paper, an impulsive boundary value problem on the half-line is considered and existence of solutions is proved using Minimization Principal and Mountain Pass Theorem.